import java.util.ArrayList;
import java.util.Comparator;

public class Dame {
	public static void main(String[] args){
		double i=12.6;
		System.out.println((int) i);
	}
	
	private static class Node{
		public Node ls;
		public Node rs;
		public int weight=0;
	}
	
	private static ArrayList<Node> iterBtree(Node btree){
		if (btree==null){
			return null;
		}
		ArrayList<Node> array=new ArrayList<Node>();
		ArrayList<Node> larray=iterBtree(btree.ls);
		if(larray!=null){
			array.addAll(larray);
		}
		if(btree.weight>50){
			array.add(btree);
		}
		ArrayList<Node> rarray=iterBtree(btree.rs);
		if(rarray!=null){
			array.addAll(rarray);
		}
		return array;
	}

	private static <T> void quickSort(T[] src, T[] dest, int low,
			int high, int off, Comparator<T> c) {
		int length = high - low;

		if (length < 2) {
			for (int i = low; i < high; i++)
				for (int j = i; j > low && c.compare(dest[j - 1], dest[j]) > 0; j--)
					swap(dest, j, j - 1);
			return;
		}

		int destLow = low;
		int destHigh = high;
		low += off;
		high += off;
		int mid = (low + high) >>> 1;
		quickSort(dest, src, low, mid, -off, c);
		quickSort(dest, src, mid, high, -off, c);

		if (c.compare(src[mid - 1], src[mid]) <= 0) {
			System.arraycopy(src, low, dest, destLow, length);
			return;
		}

		for (int i = destLow, p = low, q = mid; i < destHigh; i++) {
			if (q >= high || p < mid && c.compare(src[p], src[q]) <= 0)
				dest[i] = src[p++];
			else
				dest[i] = src[q++];
		}
	}

	/**
	 * Swaps x[a] with x[b].
	 */
	private static void swap(Object[] x, int a, int b) {
		Object t = x[a];
		x[a] = x[b];
		x[b] = t;
	}
}
